Optimizing Radial Basis Functions by D.C. Programming and its use in Direct Search for Global Derivative-Free Optimization

نویسندگان

  • Le Thi Hoai An
  • A. I. F. Vaz
  • L. N. Vicente
چکیده

In this paper we address the global optimization of functions subject to bound and linear constraints without using derivatives of the objective function. We investigate the use of derivative-free models based on radial basis functions (RBFs) in the search step of direct-search methods of directional type. We also study the application of algorithms based on difference of convex (d.c.) functions programming to solve the resulting subproblems which consist of the minimization of the RBF models subject to simple bounds on the variables. Extensive numerical results are reported with a test set of bound and linearly constrained problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RBF-Chebychev direct method for solving variational problems

This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...

متن کامل

A new trust-region algorithm based on radial basis function interpolation

Optimization using radial basis functions as an interpolation tool in trust-region (ORBIT), is a derivative-free framework based on fully linear models to solve unconstrained local optimization, especially when the function evaluations are computationally expensive. This algorithm stores the interpolation points and function values to using at subsequent iterations. Despite the comparatively ad...

متن کامل

Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions

Optimization Involving Expensive Black-Box Objective and Constraint Functions Rommel G. Regis Mathematics Department, Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] August 23, 2010 Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-box objective functions subject to expensive black-box inequality constraints. The proposed al...

متن کامل

Improving Accuracy of DGPS Correction Prediction in Position Domain using Radial Basis Function Neural Network Trained by PSO Algorithm

Differential Global Positioning System (DGPS) provides differential corrections for a GPS receiver in order to improve the navigation solution accuracy. DGPS position signals are accurate, but very slow updates. Improving DGPS corrections prediction accuracy has received considerable attention in past decades. In this research work, the Neural Network (NN) based on the Gaussian Radial Basis Fun...

متن کامل

The use of inverse quadratic radial basis functions for the solution of an inverse heat problem

‎In this paper‎, ‎a numerical procedure for an inverse problem of‎ ‎simultaneously determining an unknown coefficient in a semilinear ‎parabolic equation subject to the specification of the solution at‎ ‎an internal point along with the usual initial boundary conditions ‎is considered‎. ‎The method consists of expanding the required‎ ‎approximate solution as the elements of the inverse quadrati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009